Axiomatizing ELgfp-General Concept Inclusions in the Presence of Untrusted Individuals

نویسنده

  • Daniel Borchmann
چکیده

To extract terminological knowledge from data, Baader and Distel have proposed an effective method that allows for the extraction of a base of all valid general concept inclusions of a given finite interpretation. In previous works, to be able to handle small amounts of errors in our data, we have extended this approach to also extract general concept inclusions which are “almost valid” in the interpretation. This has been done by demanding that general concept inclusions which are “almost valid” are those having only an allowed percentage of counterexamples in the interpretation. In this work, we shall further extend our previous work to allow the interpretation to contain both trusted and untrusted individuals, i. e. individuals from which we know and do not know that they are correct, respectively. The problem we then want to solve is to find a compact representation of all terminological knowledge that is valid for all trusted individuals and is almost valid for all others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizing Confident EL^bot_gfp-General Concept Inclusions in the Presence of Untrusted Individuals

To extract terminological knowledge from data, Baader and Distel have proposed an effective method that allows for the extraction of a base of all valid general concept inclusions of a given finite interpretation. In previous works, to be able to handle small amounts of errors in our data, we have extended this approach to also extract general concept inclusions which are “almost valid” in the ...

متن کامل

Exploring Finite Models in the Description Logic ELgfp

In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. In this paper, we address the problem of how to compute this basis efficiently, by adapting methods from formal concept analysis.

متن کامل

Model Exploration by Confidence with Completely Specified Counterexamples

We present an extensions of our previous work on axiomatizing confident general concept inclusions in given finite interpretations. Within this extension we allow external experts to interactively provide counterexamples to general concept inclusions with otherwise enough confidence in the given data. This extensions allows us to distinguish between erroneous counterexamples in the data and rar...

متن کامل

An Approach to Exploring Description Logic Knowledge Bases

This paper is the successor to two previous papers published at the ICFCA conference. In the first paper we have shown that in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. An exploration formalism that can be used to obtain this basis was presented in the second paper. In this paper we show how this formalism can...

متن کامل

A SYSTEM OF GENERALIZED VARIATIONAL INCLUSIONS INVOLVING G-eta-MONOTONE MAPPINGS

We introduce a new concept of general $G$-$eta$-monotone operator generalizing the general $(H,eta)$-monotone operator cite{arvar2, arvar1}, general $H-$ monotone operator cite{xiahuang} in Banach spaces, and also generalizing $G$-$eta$-monotone operator cite{zhang}, $(A, eta)$-monotone operator cite{verma2}, $A$-monotone operator cite{verma0}, $(H, eta)$-monotone operator cite{fanghuang}...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013